Kernel Level Speculative DSM
نویسنده
چکیده
Interprocess communication (IPC) is ubiquitous in today’s computing world. One of the simplest mechanisms for IPC is shared memory. We present a system that enhances the System V IPC API to support distributed shared memory by using speculations. Speculations provide performance improvements by enabling rollback of overly optimistic speculative executions. The paper describes a speculative total order communication protocol, a speculative sequential consistency model, and a speculative distributed locking mechanism. These are supported by a mathematical model showing the advantages of speculative execution over traditional execution. Our DSM system is part of Mojave system, which consists of a compiler and operating system extensions designed to support speculations and process migration. The goal of our system is to provide a simpler programming paradigm for designers of distributed system.
منابع مشابه
Efficient exploitation of kernel access to Infiniband: a software DSM example
The Infiniband (IB) System Area Network (SAN) enables applications to access hardware directly from user level, reducing the overhead of user-kernel crossings during data transfer. However, distributed applications that exhibit close coupling between network and OS services may benefit from accessing IB from the kernel through IB’s native Verbs interface, which permits tight integration of thes...
متن کاملA Unified Approach to Speculative Parallelization of Loops in DSM Multiprocessors
Speculative parallel execution of statically non-analyzable codes on Distributed Shared-Memory (DSM) multiprocessors is challenging because of the long latency and memory distribution present. However, such an approach may well be the best way of speeding up codes whose dependences can not be compiler analyzed. In this paper, we have extended past work by proposing a hardware scheme for the spe...
متن کاملProgramming Large Dynamic Data Structures on a DSM Cluster of Multicores∗
Applications in increasingly important domains such as data mining and graph analysis operate on very large, dynamically constructed graphs, i.e. they are composed of dynamically allocated objects linked together via pointers. Parallel algorithms on large graphs can greatly benefit from software Distributed Shared Memory’s (DSM) convenience of sharedmemory programming and computational scalabil...
متن کاملAdaptive DSM-Runtime Behavior via Speculative Data Distribution
Traditional distributed shared memory systems (DSM) suffer from the overhead of communication latencies and data fault handling. This work explores the benefits of reducing these overheads and evaluating the savings. Data fault handling can be reduced by employing a lock-oriented consistency protocol that synchronizes data when acquiring and releasing a lock, which eliminates subsequent faults ...
متن کاملOperating System I/O Speculation: How Two Invocations Are Faster Than One
We present an in-kernel disk prefetcher which uses speculative execution to determine what data an application is likely to require in the near future. By placing our design within the operating system, we provide several benefits compared to the previous application-level design. Not only is our system easier to implement and deploy, but by handling page faults as well as traditional file-acce...
متن کامل